An interval algorithm for constrained global optimization
نویسندگان
چکیده
منابع مشابه
Efficient interval partitioning for constrained global optimization
1 Nanyang Technological University, School of Mechanical and Aerospace Engineering, Singapore, 2 New England Biolabs Inc., 240 County Road, Ipswich, MA [email protected] 3 Izmir Ekonomi Universitesi, Izmir, Turkey [email protected] 4 University of Szeged, Institute of Informatics, Szeged, Hungary [email protected] 5 Advanced Concepts Team, ESA/ESTEC, Noordwijk, The Netherlands Tam...
متن کاملNew interval methods for constrained global optimization
Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adaptive multisection rules which enable the algorithm to choose the proper multisection type depending on simple heuristic decision rules. Moreover, for the selection of the next box to be subdivided, we investigate new criteria. ...
متن کاملA New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems
Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...
متن کاملUncertain constrained optimization by interval-oriented algorithm
This paper deals with an interval-oriented approach to solve general interval constrained optimization problems. Generally, this type of problems has infinitely many compromise solutions. The aim of this approach is to obtain one of such solutions with higher accuracy and lower computational cost. The proposed algorithm is nothing but a different kind of branch and bound algorithm with multi-se...
متن کاملImproved Cuckoo Search Algorithm for Global Optimization
The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1994
ISSN: 0377-0427
DOI: 10.1016/0377-0427(94)90331-x